A Logic of Graded Possibility and Certainty Coping with Partial Inconsistency
نویسندگان
چکیده
A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The proposed semantics is based on fuzzy sets of interpretations. It is tolerant to partial inconsistency. Satisfiability is extended from interpretations to fuzzy sets of interpretations, each fuzzy set representing a possibility distribution describing what is known about the state of the world. A possibilistic know ledge base is then viewed as a set of possibility distributions that satisfy it. The refutation method of automated deduction in possibilistic logic, based on previously introduced generalized resolution principle is proved to be sound and complete with respect to the proposed semantics, including the case of partial inconsistency.
منابع مشابه
Quasi-Possibilistic Logic and its Measures of Information and Conflict
Possibilistic logic and quasi-classical logic are two logics that were developed in artificial intelligence for coping with inconsistency in different ways, yet preserving the main features of classical logic. This paper presents a new logic, called quasi-possibilistic logic, that encompasses possibilistic logic and quasi-classical logic, and preserves the merits of both logics. Indeed, it can ...
متن کاملPossibilistic reasoning with partially ordered beliefs
This paper presents the extension of results on reasoning with totally ordered belief bases to the partially ordered case. The idea is to reason from logical bases equipped with a partial order expressing relative certainty and to construct a partially ordered deductive closure. The difficult point lies in the fact that equivalent definitions in the totally ordered case are no longer equivalent...
متن کاملPossibilistic logic: a retrospective and prospective view
Possibilistic logic is a weighted logic introduced and developed since the mid-1980s, in the setting of arti(cial intelligence, with a view to develop a simple and rigorous approach to automated reasoning from uncertain or prioritized incomplete information. Standard possibilistic logic expressions are classical logic formulas associated with weights, interpreted in the framework of possibility...
متن کاملValid or Complete Information in Databases - A Possibility Theory-Based Analysis
The validity of the information stored in a database may be guaranteed or not, according to the family of items which is considered. The information available in the database may be complete or not, as well, for a given type of items. The paper discusses how these forms of uncertainty can be represented in the framework of possibility theory, and how queries to a database where information is n...
متن کاملParaconsistency properties in degree-preserving fuzzy logics
Paraconsistent logics are specially tailored to deal with inconsistency, while fuzzy logics primarily deal with graded truth and vagueness. Aiming to find logics that can handle inconsistency and graded truth at once, in this paper we explore the notion of paraconsistent fuzzy logic. We show that degree-preserving fuzzy logics have paraconsistency features and study them as logics of formal inc...
متن کامل